Tiara: A self-stabilizing deterministic skip list and skip graph
نویسندگان
چکیده
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.
منابع مشابه
Tiara: A Self-stabilizing Deterministic Skip List
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and updates and it stabilizes in linear time. It is based on sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its refinement to the messa...
متن کاملCorona: A Stabilizing Deterministic Message-Passing Skip List
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing str...
متن کاملOn the Search Path Length of Random Binary Skip Graphs
In this paper we consider the skip graph data structure, a load balancing alternative to skip lists, designed to perform better in a distributed environment. We extend previous results of Devroye on skip lists, and prove that the maximum length of a search path in a random binary skip graph of size n is of order logn with high probability.
متن کاملBalanced Search Trees Made Simple
As a contribution to the recent debate on simple implementa tions of dictionaries we present new maintenance algorithms for balanced trees In terms of code simplicity our algorithms compare favourably with those for deterministic and probabilistic skip lists
متن کاملThe Dense Skip Tree: A Cache-Conscious Randomized Data Structure
We introduce the dense skip tree, a novel cache-conscious randomized data structure. Algorithms for search, insertion, and deletion are presented, and they are shown to have expected cost O(logn). The dense skip tree obeys the same asymptotic properties as the skip list and the skip tree. A series of properties on the dense skip tree is proven, in order to show the probabilistic organization of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 428 شماره
صفحات -
تاریخ انتشار 2012